Circuit Complexity from Cosmological Islands

نویسندگان

چکیده

Recently in various theoretical works, path-breaking progress has been made recovering the well-known Page Curve of an evaporating black hole with Quantum Extremal Islands, proposed to solve long-standing information loss problem related unitarity issue. Motivated by this concept, paper, we study cosmological circuit complexity presence (or absence) Islands negative positive) Cosmological Constant radiation background Friedmann-Lema$\hat{i}$tre-Robertson-Walker (FLRW) space-time i.e and absence islands anti-de Sitter de spacetime having SO(2, 3) SO(1, 4) isometries respectively. Without using any explicit details gravity model, behaviour function respect dynamical solution for scale factors above-mentioned two situations FLRW squeezed state formalism. By studying complexity, Out-of-Time Ordered Correlators, entanglement entropy modes state, different parameter spaces, conclude non-universality these measures. Their remarkably features spaces suggest their dependence on parameters model under consideration.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Complexity Lower Bounds from Algebraic Circuit Complexity

We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi [GP14], where the circuits comprising the proof come from various restricted algebraic circuit classes. This mimics an established research direction in the boolean setting for subsystems of Extended Frege proofs, where proof-lines are ci...

متن کامل

Circuit Complexity

Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...

متن کامل

Quantum Circuit Complexity

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...

متن کامل

Polymorphisms and Circuit Complexity

We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function f is characterized by the partial polymorphisms of f ’s truth table. Moreover, the non-deterministic circuit complexity of f is characterized by the polymorphisms of f ’s truth table.

متن کامل

Circuit Complexity of Shuffle

We show that Shuffle(x, y, w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC, but it is in AC. The fact that shuffle is not in AC is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84], while the fact that it is in AC is implicit in the results of [Man82a]. Together, the two results p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13071301